-
1 means-end analysis
См. также в других словарях:
Continuous knapsack problem — The continuous knapsack problem, also known as the fractional knapsack problem, is similar to the classic knapsack problem but in this problem fractions of an item can be put into the knapsack. The problem is as following: Given a knapsack with… … Wikipedia
Problem-based learning — Apprentissage par problèmes Pour les articles homonymes, voir APP et PBL. Dans l apprentissage par problèmes (APP) (en anglais problem based learning, PBL), les apprenants, regroupés par équipes, travaillent ensemble à résoudre un problème… … Wikipédia en Français
Longest common subsequence problem — Not to be confused with longest common substring problem. The longest common subsequence (LCS) problem is to find the longest subsequence common to all sequences in a set of sequences (often just two). Note that subsequence is different from a… … Wikipedia
Creative Problem Solving Process — The Creative Problem Solving Process (CPS), also known as the Osborn Parnes CPS process, was developed by Alex Osborn and Dr. Sidney J. Parnes in the 1950s.[1] CPS is a structured method for generating novel and useful solutions to problems. CPS… … Wikipedia
Morphological analysis (problem-solving) — Morphological Analysis or General Morphological Analysis is a method developed by Fritz Zwicky (1967, 1969) for exploring all the possible solutions to a multi dimensional, non quantified problem complex.[1] Contents 1 Overview 1.1 Morphological… … Wikipedia
nominal group technique — NGT A group problem solving technique in which each member of the group is asked to write down a list of ideas without talking to their colleagues. The ideas elicited in this way are then discussed and criticized by the group, who are not told… … Big dictionary of business and management
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Creative problem solving — is the mental process of creating a solution to a problem. It is a special form of problem solving in which the solution is independently created rather than learned with assistance. Creative problem solving always involves creativity. To qualify … Wikipedia
Nominal group technique — The nominal group technique (NGT) is a decision making method for use among groups of many sizes, who want to make their decision quickly, as by a vote, but want everyone s opinions taken into account (as opposed to traditional voting, where only … Wikipedia
Frame problem — In artificial intelligence, the frame problem was initially formulated as the problem of expressing a dynamical domain in logic without explicitly specifying which conditions are not affected by an action. John McCarthy and Patrick J. Hayes… … Wikipedia
Cutting stock problem — The cutting stock problem is an optimization problem, or more specifically, an integer linear programming problem. It arises from many applications in industry. Imagine that you work in a paper mill and you have a number of rolls of paper of… … Wikipedia
